Weil descent attack for Kummer extensions
نویسنده
چکیده
In this paper, we show how the Weil descent attack of Gaudry, Hess and Smart can be adapted to work for some hyperelliptic curves defined over fields of odd characteristic. This attack applies to a family of hyperelliptic and superelliptic curves over quadratic field extensions, as well as two families of hyperelliptic curves defined over cubic extensions. We also show that those are the only families of nonsingular curves defining Kummer extensions for which this method will work.
منابع مشابه
On Security of Superelliptic Curves Based Cryptosystems against GHS Weil Descent Attacks
The GHS Weil descent attack by Gaudry, Hess and Smart was originally proposed to elliptic curves over finite fields of characteristic two [11]. Among a number of extensions of this attack, Diem treated the cases of hyperelliptic curves over finite fields of arbitrary odd characteristics [4]. His results were partially extended to algebraic curves of which the function fields are cyclic Galois e...
متن کاملWeil Descent Attack for Artin-Schreier Curves
In this paper, we show how the method introduced by Gaudry, Hess and Smart can be extended to a family of algebraic curves using Artin-Schreier extensions. This family also extends the number of hyperelliptic curves in characteristic 2 vulnarable to the Weil decent attack obtained by Galbraith. We also show that the genus of the resulting curve will be one of two easily computable values.
متن کاملThe GHS Attack Revisited
We generalize the Weil descent construction of the GHS attack to arbitrary Artin-Schreier extensions. We give a formula for the characteristic polynomial of Frobenius of the obtained curves and prove that the large cyclic factor of the input elliptic curve is not contained in the kernel of the composition of the conorm and norm maps. As an application we almost square the number of elliptic cur...
متن کاملGeneralising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem
We generalise the Weil descent construction of the GHS attack on the elliptic curve discrete logarithm problem (ECDLP) to arbitrary Artin-Schreier extensions. We give a formula for the characteristic polynomial of Frobenius of the obtained curves and prove that the large cyclic factor of the input elliptic curve is not contained in the kernel of the composition of the conorm and norm maps. As a...
متن کاملCanonical Heights on the Jacobians of Curves of Genus 2 and the Infinite Descent
We give an algorithm to compute the canonical height on a Jacobian of a curve of genus 2. The computations involve only working with the Kummer surface and so lengthy computations with divisors in the Jacobian are avoided. We use this height algorithm to give an algorithm to perform the “infinite descent” stage of computing the Mordell-Weil group. This last stage is performed by a lattice enlar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003